Numerical comparisons of nonlinear convergence accelerators
نویسندگان
چکیده
منابع مشابه
Numerical Comparisons of Nonlinear Convergence Accelerators
As part of a continuing program of numerical tests of convergence accelerators, we have compared the iterated Aitken's A2 method, Wynn's e algorithm, Brezinski's 0 algorithm, and Levin's u transform on a broad range of test problems: linearly convergence alternating, monotone, and irregular-sign series, logarithmically convergent series, power method and Bernoulli method sequences, alternating ...
متن کاملConvergence of Numerical Method For the Solution of Nonlinear Delay Volterra Integral Equations
In this paper, Solvability nonlinear Volterra integral equations with general vanishing delays is stated. So far sinc methods for approximating the solutions of Volterra integral equations have received considerable attention mainly due to their high accuracy. These approximations converge rapidly to the exact solutions as number sinc points increases. Here the numerical solution of nonlinear...
متن کاملNUMERICAL OPTIMIZATION OF ACCELERATORS WITHIN oPAC
Powerful simulation tools are required for every accelerator and light source to study the motion of charged particles through electromagnetic fields during the accelerator design process, to optimize the performance of machine diagnostics and to assess beam stability and non-linear effects. The Optimization of Particle Accelerators (oPAC) Project is funded by the EU within the 7 Framework Prog...
متن کاملOld and New Multidimensional Convergence Accelerators
In the past some multidimensional convergence accelerators have been studied by Levin [13], by Albertsen, Jacobsen and Sorensen [l] and by the author [5]. We show here that all these multidimensional convergence accelerators are particular cases of a whole class of multidimensional convergence accelerators. The common underlying principle is that they can be considered as multivariate Pad& appr...
متن کاملComputational Gravitational Dynamics with Modern Numerical Accelerators
We review the recent optimizations of gravitational N -body kernels for running them on graphics processing units (GPUs), on single hosts and massive parallel platforms. For each of the two main N -body techniques, direct summation and treecodes, we discuss the optimization strategy, which is different for each algorithm. Because both the accuracy as well as the performance characteristics diff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1982
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1982-0645665-1